An SKU decomposition algorithm for the tactical planning in the FMCG industry
نویسندگان
چکیده
منابع مشابه
An SKU decomposition algorithm for the tactical planning in the FMCG industry
In this paper we address the optimization of the tactical planning for the Fast Moving Consumer Goods (FMCG) industry, in which numerous trade-offs need to be considered over possibly thousands of Stock-Keeping Units (SKUs). An MILP model for the optimization of this tactical planning problem is proposed. This model is demonstrated for a case containing 10 SKUs, but is intractable for realistic...
متن کاملSKU decomposition algorithms for the tactical planning in the FMCG Industry
Tactical planning MILP models for fast moving consumer goods companies are often intractable for realistic applications containing thousands of Stock-Keeping Units (SKUs). Decomposition methods can be applied to these MILP models to allow realistic cases to be optimized. In this paper we present a Multi-SKU decomposition algorithm based on decomposing the full scale MILP model into submodels co...
متن کاملTactical Planning in the Fast Moving Consumer Goods Industry: an Sku Decomposition Algorithm
Tactical planning models for the Fast Moving Consumer Goods (FMCG) industry can quickly become intractable due to the extremely large number of Stock Keeping Units (SKUs). We propose an SKU decomposition algorithm that is aimed at being able to solve cases containing thousands of SKUs. The full tactical planning model is decomposed into a set of single SKU models. These models are then solved s...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOptimizing the Tactical Planning in the FMCG Industry Considering Shelf-Life Restrictions
In this paper we address the optimization of the tactical planning for the Fast Moving Consumer Goods industry using an MILP model. Shelf-life restrictions are introduced into this model to prevent unnecessary waste and missed sales. Three methods for implementing shelf-life restriction are compared. In the direct method the age of each product is tracked. While this method can provide optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemical Engineering
سال: 2014
ISSN: 0098-1354
DOI: 10.1016/j.compchemeng.2013.11.008